Partial Evaluation of Higher-Order Natural-Semantics Derivations
نویسنده
چکیده
We use on-line partial-evaluation technology to generate partial derivations from natural (big-step) semantics deenitions. First, we reformat the big-step rules into a small-step form, and we extend big-step semantics to be higher-order, that is, we allow data structures like closures to contain partial derivations. Next, we apply a supercompilation algorithm to the transformed semantics, thereby producing partial derivations for programs and exposing the programs' control structures. The resulting system can perform static analysis on incomplete or \modular" programs and can do double duty as a link-time static analyzer; these are signiicant steps towards modular program analysis.
منابع مشابه
Adapting Big-Step Semantics to Small-Step Style: Coinductive Interpretations and "Higher-Order" Derivations
We adapt Kahn-style (\big-step") natural semantics to take on desirable aspects of small-step and denotational semantics forms, more precisely: (i) the ability to express divergent computations; (ii) the ability to reason about the (length of a) computation of a derivation; and (iii) the ability to compute upon and reason about higher-order values. To accomplish these results, we extend the cla...
متن کاملElf: A Meta-Language for Deductive Systems (System Descrition)
1 Overview Elf is a uniform metalanguage for the formalization of the theory of programming languages and logics. It provides means for 1. specifying the abstract syntax and semantics of an object language in a natural and direct way; 2. implementing related algorithms (e.g., for type inference, evaluation, or proof search); and 3. representing proofs of meta-theorems about an object language, ...
متن کاملInvited Talk: On the Concurrent Semantics of Transformation Systems with Negative Application Conditions
A rich concurrent semantics has been developed along the years for graph transformation systems, often generalizing in non-trivial ways concepts and results first introduced for Petri nets. Besides the theoretical elegance, the concurrent semantics has potential applications in verification and model checking, as witnessed by techniques like partial order reduction or the use of finite, complet...
متن کاملA Study in Higher-Order Programming Languages MS Thesis
This thesis describes some interplays between the specification and the implementation of higher-order programming languages. We first investigate a traditional implementation of Scheme (compiler, run-time machine). We then turn to Action Semantics. And finally we cross-fertilize these two approaches using both syntax-directed and type-directed partial evaluation and introducing an alternative ...
متن کاملPartial Evaluation of the "Real Thing"
In this paper we present a partial evaluation scheme for a \real life" subset of Prolog. This subset contains rst-order built-in's, simple side-eeects and the operational predicate if-then-else. We outline a denotational semantics for this subset of Prolog and show how partial deduction can be extended to specialise programs of this kind. We point out some of the problems not occurring in parti...
متن کامل